Short proofs for interval digraphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Short proofs for interval digraphs

We give short proofs of the adjacency matrix characterizations of interval digraphs and unit interval digraphs.

متن کامل

Adjusted Interval Digraphs

Interval digraphs were introduced by West et all. They can be recognized in polynomial time and admit a characterization in terms of incidence matrices. Nevertheless, we do not have a forbidden structure characterization nor a low-degree polynomial time algorithm. We introduce a new class of ‘adjusted interval digraphs’, obtained by a slight change in the definition. By contrast, these digraphs...

متن کامل

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms

Interval graphs admit linear time recognition algorithms and have several elegant forbidden structure characterizations. Interval digraphs can also be recognized in polynomial time and admit a characterization in terms of incidence matrices. Nevertheless, they do not have a known forbidden structure characterization or low-degree polynomial time recognition algorithm. We introduce a new class o...

متن کامل

Recognition and Characterization of Chronological Interval Digraphs

Interval graphs admit elegant ordering and structural characterizations as well as linear time recognition algorithms. On the other hand, the usual interval digraphs lack all three of these characteristics. In this paper we identify another natural digraph analogue of interval graphs that we call “chronological interval digraphs”. By contrast, the new class admits an ordering characterization, ...

متن کامل

Classes of Interval Digraphs and 0 , 1 -

We consider a hierarchy of four classes of interval digraphs, or equivalently four classes of 0,1-matrics. We provide forbidden submatrix characterizations separating the successive classes. The largest class is the set of (adjacency matrices of) interval digraphs; the smallest is the set of (adjacency matrices of) unit interval digraphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)81840-7